The m - Cover Posets and the Strip - Decomposition of m - Dyck Paths ( Extended

نویسنده

  • Henri Mühle
چکیده

In the first part of this article we present a realization of the m-Tamari lattice T (m) n in terms of m-tuples of Dyck paths of height n, equipped with componentwise rotation order. For that, we define the m-cover poset P〈m〉 of an arbitrary bounded poset P , and show that the smallest lattice completion of the m-cover poset of the Tamari lattice Tn is isomorphic to the m-Tamari lattice T (m) n . A crucial tool for the proof of this isomorphism is a decomposition of m-Dyck paths into m-tuples of classical Dyck paths, which we call the strip-decomposition. Subsequently, we characterize the cases where the m-cover poset of an arbitrary poset is a lattice. Finally, we show that the m-cover poset of the Cambrian lattice of the dihedral group is a trim lattice with cardinality equal to the generalized FussCatalan number of the dihedral group. Résumé. Dans la première partie de cet article nous présentons une réalisation du treillis m-Tamari T (m) n à l’aide de m-uplets de chemins de Dyck de hauteur n, équipés de l’ordre de rotation composante par composante. Pour cela, nous définissons le poset de m-couverture P〈m〉 d’un poset borné quelconque P , et montrons que la plus petite complétion en treillis du poset de m-couverture du treillis de Tamari Tn est isomorphe au treillis m-Tamari T (m) n . Un outil crucial pour la preuve de cet isomorphisme est une décomposition des chemins m-Dyck en m-uplets de chemins de Dyck usuels, que nous appelons la décomposition en bandes. Par la suite, nous caractérisons les cas où le poset de m-couverture d’un poset donné est un treillis. Enfin nous montrons que le poset de m-couverture du treillis Cambrien du groupe diédral est un treillis svelte de cardinalité le nombre généralisé de Fuss-Catalan du groupe diédral.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dyck tilings , linear extensions , descents , and inversions ( extended abstract )

Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths. We give two bijections between “cover-inclusive” Dyck tilings and linear extensions of tree posets. The first bijection maps the statistic (area + tiles)/2 to inversions of the linear extension, and the seco...

متن کامل

1 9 N ov 2 00 4 Lattices of lattice paths ∗

We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e., lattices of Dyck paths) and give a recursive construction for them. The last section is devoted to the presentation of a couple of open problems.

متن کامل

A Decomposition of Parking Functions by Undesired Spaces

There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of the corresponding maximal chains. We introduce a decomposition of parking functions based on the largest number omitted and prove several theorems about the c...

متن کامل

The concept of logic entropy on D-posets

In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied.  The invariance of the {it logic entropy} of a system  under isomorphism is proved. At the end,  the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...

متن کامل

The butterfly decomposition of plane trees

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a oneto-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the Catalan numbers and the central binomial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014